package 笔试.深信服.解码;

import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
//        int n=scan.nextInt();

//        for (int i = 0; i < n; i++) {
//            int m=scan.nextInt();
//        }
//        Map<Integer,Node> map=new LinkedHashMap<>();
//        for (int i = 0; i < m; i++) {
//            int val=scan.nextInt();
//            int next=scan.nextInt();
//            map.put(i,new Node(val,next));
//        }
        int n = scan.nextInt();
        for (int i = 0; i < n; i++) {
            int m = scan.nextInt();
            for (int j = 0; j < m; j++) {
                int val = scan.nextInt();
                int row = scan.nextInt();

            }
        }

    }
}

class Node {
    int val;
    int row;
    Node next;

    public Node(int val, int row) {
        this.val = val;
        this.row = row;
    }

    public Node(int val, int row, Node next) {
        this.val = val;
        this.row = row;
        this.next = next;
    }
}
